import java.util.Scanner;

class Solution {

    //最长递增子序列
    static int[] arr;
    static int ret;
    public static int lengthOfLIS(int[] nums) {
        int len = nums.length;
        arr = new int[len+1];
        ret = 1;
        arr[1] = nums[0];//先将第一个数放入数组中
        for(int i = 1; i < len; i++){
            //查找
            find(nums[i]);
        }
        return ret;
    }
    public static void find(int n){
        if(n > arr[ret]) {//大于最大的数，更新长度，且将其放入
            ret++;
            arr[ret] = n;
            return;
        }
        //二分查找
        int left = 1, right = ret;
        while(left < right){
            int mid = (left + right) / 2;
            if(n > arr[mid]) left = mid + 1;
            else right = mid;
        }
        //更新
        if(n < arr[left]) arr[left] = n;
    }

    //递增的三元子序列
    public boolean increasingTriplet(int[] nums) {
        int len = nums.length;
        arr = new int[len + 1];
        arr[1] = nums[0];
        ret = 1;
        for(int i = 1; i < len; i++){
            if(ret >= 3) return true;
            find1(nums[i]);
        }
        return ret >= 3;
    }
    public void find1(int n){
        if(n > arr[ret]){
            ret++;
            arr[ret] = n;
            return;
        }
        //二分查找
        int left = 1, right = ret;
        while(left < right){
            int mid = (left + right) / 2;
            if(n > arr[mid]) left = mid + 1;
            else right = mid;
        }
        if(n < arr[left]) arr[left] = n;
    }

    //最长连续递增子序列
    public static int findLengthOfLCIS(int[] nums) {
        int left = 0;
        int ret = 1;
        for(int right = 1; right < nums.length; right++){
            if(nums[right] <= nums[right - 1]){
                left = right;
            }else{
                if(ret < right - left + 1){
                    ret = right - left + 1;
                }
            }
        }
        return ret;
    }

    //买卖股票的最佳时机
    public int maxProfit(int[] prices) {
        int prevMin = Integer.MAX_VALUE;
        int ret = 0;
        for(int i = 0; i < prices.length; i++){
            if(prices[i] < prevMin){
                prevMin = prices[i];
            }
            if(prices[i] - prevMin > ret) ret = prices[i] - prevMin;
        }
        return ret;
    }

    //买卖股票的最佳时机II(双指针)
    public int maxProfitII(int[] prices) {
        int ret = 0;
        int left = 0, i = 0;
        for(i = 1; i < prices.length; i++){
            if(prices[i] < prices[i-1]){
                ret += (prices[i-1] - prices[left]);
                left = i;
            }
        }
        if(prices[i-1] > prices[left]) ret += prices[i-1] - prices[left];//加上最后一段
        return ret;
    }

    //买卖股票的最佳时机II(拆分交易)
    public int maxProfit2(int[] prices) {
        int ret = 0;
        for(int i = 1; i < prices.length; i++){
            if(prices[i] - prices[i-1] > 0){
                ret += prices[i] - prices[i-1];
            }
        }
        return ret;
    }

    //跳台阶扩展问题
    public int jumpFloorII (int number) {
        // write code here
        int[] dp = new int[number + 1];
        int sum = 0;
        for(int i = 1; i <= number; i++){
            dp[i] = 1 + sum;
            sum += dp[i];
        }
        return dp[number];
    }

    //快到碗里来
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNext()) { //n (1≤n≤2^128) 和r (1≤r≤2^128)
            double n = in.nextDouble();
            double r = in.nextDouble();
            double c = 2*r*3.14;
            if(c < n){
                System.out.println("No");
            }else{
                System.out.println("Yes");
            }
        }
    }

    public static void main(String[] args) {
        int[] nums = {2,2,2,2,2};
      //  lengthOfLIS(nums);
        System.out.println(findLengthOfLCIS(nums));
    }
}